Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and k-maximum density paths
نویسندگان
چکیده
منابع مشابه
Optimal Algorithms for Finding Density-Constrained Longest and Heaviest Paths in a Tree
Let T be a tree with n nodes, in which each edge is associated with a length and a weight. The density-constrained longest (heaviest) path problem is to find a path of T with maximum path length (weight) whose path density is bounded by an upper bound and a lower bound. The path density is the path weight divided by the path length. We show that both problems can be solved in optimal O(n logn) ...
متن کاملAlgorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence
In this work, we obtain the following new results: – Given a tree T = (V, E) with a length function ` : E → R and a weight function w : E → R, a positive integer k, and an interval [L, U ], the Weight-Constrained k Longest Paths problem is to find the k longest paths among all paths in T with weights in the interval [L,U ]. We show that the Weight-Constrained k Longest Paths problem has a lower...
متن کاملFinding a Length-Constrained Maximum-Density Path in a Tree
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E , where w(e) is an edge weight function for e ∈ E . The density of a path, say e1, e2, . . . , ek , is defined as ∑k i=1 w(ei )/k. The length of a path is the number of its edges. Given a tree with n edges and a lower bound L where 1 ≤ L ≤ n, this paper presents two efficient algorithms for finding a maximum-den...
متن کاملResource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theoretical and experimental results for CSP. In the theoretical part we present the hull approach, a combinatorial algorithm for solving a linear programming relaxation and prove that it runs in polynomial time in the case...
متن کاملSmarandachely k-Constrained Number of Paths and Cycles
A Smarandachely k-constrained labeling of a graph G(V, E) is a bijective mapping f : V ∪ E → {1, 2, .., |V | + |E|} with the additional conditions that |f(u) − f(v)| ≥ k whenever uv ∈ E, |f(u)−f(uv)| ≥ k and |f(uv)−f(vw)| ≥ k whenever u 6= w, for an integer k ≥ 2. A graph G which admits a such labeling is called a Smarandachely k-constrained total graph, abbreviated as k−CTG. The minimum number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.07.024